pgp dmc multicor parallel approach mine gradual pattern pgp dmc extract paral le efficac de motif graduel couvert itemset fr quent ferm sur architectur multicoeur discov close frequent itemset multicor parallel comput optim memori access discov close frequent itemset multicor parallel comput optim memori access combin logic probabl discov map taxonomi dryadepar effici robust close attribut tree mine algorithm digdag algorithm mine close frequent embed ddag effici mine high branch factor attribut tree dryad approach discov close frequent tree heterogen tree databas abstract paper present algorithm discov ing tree pattern tree databas algorithm relax tree inclus definit make problem morecomplex check tree inclus np complet allow mine highli heterogen databas obtaingood perform ryad algorithm discov onlyclos frequent tree pattern treefind step xml data mine rais dead extend evolutionari algorithm case dbase memori dynam chang environ perform standard evolutionari algorithm deterior due fact popul consid histori evolutionari process inform algorithm react adequ fit landscap ad simpl global case base memori process track interest histor event introduct memori store replac scheme improv reaction capabl evolutionari algorithm period chang fit function combin statist semant word document cluster approach construct pseudo keyword refer sens unit propos sens unit obtain word cluster process underli similar reflect statist semant properti detect latent semant analysi wordnet 